Critically partitionable graphs II
نویسندگان
چکیده
منابع مشابه
Antitwins in partitionable graphs
Undefined standard terminology can be found in [3]. Berge [l] proposed to call a graph G perfect if for every induced subgraph H of G the vertices of H can be coloured with a number of colours equal to the maximum size of a clique of H, in such a way that no two adjacent vertices are assigned the same colour. Later on, Berge [2] conjectured that a graph is perfect if and only if it contains no ...
متن کاملDense arbitrarily partitionable graphs
A graph G of order n is called arbitrarily partitionable (AP for short) if, for every sequence (n1, . . . , nk) of positive integers with n1 + · · · + nk = n, there exists a partition (V1, . . . , Vk) of the vertex set V (G) such that Vi induces a connected subgraph of order ni for i = 1, . . . , k. In this paper we show that every connected graph G of order n ≥ 22 and with ‖G‖ >
متن کاملUniquely partitionable graphs
Let P1, . . . ,Pn be properties of graphs. A (P1, . . . ,Pn)-partition of a graph G is a partition of the vertex set V (G) into subsets V1, . . . , Vn such that the subgraph G[Vi] induced by Vi has property Pi; i = 1, . . . , n. A graph G is said to be uniquely (P1, . . . ,Pn)-partitionable if G has exactly one (P1, . . . ,Pn)-partition. A property P is called hereditary if every subgraph of ev...
متن کاملPerfect Graphs, Partitionable Graphs and Cutsets
A graph G is perfect if, for all induced subgraphs of G, the size of a largest clique is equal to the chromatic number. A graph is minimally imperfect if it is not perfect but all its proper induced subgraphs are. A hole is a chordless cycle of length at least four. The strong perfect graph conjecture of Berge [1] states that G is minimally imperfect if and only if G or its complement is an odd...
متن کاملRecursive generation of partitionable graphs
Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potential counterexamples to Berge’s famous Strong Perfect Graph Conjecture. A recursive method of generating partitionable graphs was suggested by Chvátal, Graham, Perold and Whitesides (1979). Results of Sebő (1996) entail that Berge’s conjecture holds for all the partitionable graphs obtained by this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1982
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90083-8